skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Talebizadeh_Sardari, Naser"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Mathematics of Computation)
    We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth’s linear programming method to decrease the number of variables required in the new problem of interest. This allows for faster convergence recovering Schur’s bound in the simplest case and Siegel’s bound in the second simplest case of our new family of bounds. We also prove the existence of a unique optimal solution to our newly phrased problem and express the optimal solution in terms of polynomials. Lastly, we solve this new problem numerically with a gradient descent algorithm to attain the new bound 1.80203. 
    more » « less
    Free, publicly-accessible full text available July 1, 2026